A simple correctness proof for magic transformation
نویسنده
چکیده
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The correctness property concerns the declarative semantics. The proof, however, refers to the operational semantics (LD-resolution) of the source programs. Its conciseness is due to applying a suitable proof method.
منابع مشابه
A Simple Correctness Proof of the Direct-Style Transformation
We build on Danvy and Nielsen’s first-order program transformation into continuation-passing style (CPS) to present a new correctness proof of the converse transformation, i.e., a one-pass transformation from CPS back to direct style. Previously published proofs were based on CPS transformations that were either higher-order, noncompositional, or operating in two passes, and were correspondingl...
متن کاملEecient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملEfficient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملRegister Allocation by Proof Transformation
This paper presents a proof-theoretical framework for register allocation that accounts for the entire process of register allocation. Liveness analysis is proof reconstruction (similar to type inference), and register allocation is proof transformation from a proof system with unrestricted variable accesses to the one with restricted variable access. In our framework, the set of registers acts...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 12 شماره
صفحات -
تاریخ انتشار 2012